Approximating minimum cocolorings

Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems

Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees p. 152 Improved Algorithms for Data Migration p. 164 Approximation Algorithms for Graph Homomorphism Problems p. 176 Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem p. 188 Hardness of Preemptive Finite Capacity Dial-a-Ride Inge Li Gortz p. 200 Minimum Vehicle Routing with a Common Deadline p. 212 Stochasti...

Strengthened Hardness for Approximating Minimum Unique Game and Small Set Expansion

In this paper, the author puts forward a variation of Feige’s Hypothesis, which claims that it is hard on average refuting Unbalanced Max 3-XOR against biased assignments on a natural distribution. Under this hypothesis, the author strengthens the previous known hardness for approximating Minimum Unique Game, 5/4 − ǫ, by proving that Min 2-Lin-2 is hard to within 3/2 − ǫ and strengthens the pre...

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem

We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that, MIN-MAX-SUBDAG problem, which is a generalization of MINLO...

Approximating The Minimum Equivalent Digraph

Approximating the Minimum Equivalent Digraph

1 Introduction